The bondi problem revisited: A spectral domain decomposition code

نویسندگان

چکیده

In this paper, we present a simple domain decomposition code based on the Galerkin-Collocation method to integrate field equations of Bondi problem. The algorithm is stable, exhibits exponential convergence when considering formula as an error measure, and computationally economical. We have incorporated features both Galerkin Collocation methods along with establishment two nonoverlapping subdomains. further applied show decay mass in nonlinear regime its power-law late-time decay. Another application determination waveforms at future null infinity connected distinct initial data.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domain Decomposition Methods for a Complementarity Problem∗

We introduce a family of parallel Newton-Krylov-Schwarz methods for solving complementarity problems. The methods are based on a smoothed grid sequencing method, a semismooth inexact Newton method, and a twogrid restricted overlapping Schwarz preconditioner. We show numerically that such an approach is highly scalable in the sense that the number of Newton iterations and the number of linear it...

متن کامل

Domain Decomposition Spectral Approximations for an Eigenvalue Problem with a Piecewise Constant Coefficient

Consider a model eigenvalue problem with a piecewise constant coefficient. We split the domain at the discontinuity of the coefficient function and define the multidomain variational formulation for the eigenproblem. The discrete multidomain variational formulations are defined for Legendre–Galerkin and Legendre-collocation methods. The spectral rate of convergence of the approximate eigensolut...

متن کامل

Protein domain decomposition using spectral graph partitioning

Proteins usually consist of several structural domains which play an important role in the classification and analysis of them. As the number of known protein structures grows at an exponential rate, a computer-aided domain decomposition of proteins becomes desirable. We present three different decomposition methods in this report. They are based on a graph representation of the proteins. These...

متن کامل

Domain Decomposition: a Blowup Problem and the Ginzburg{landau Equations

In two of our recent projects, the technique of domain decomposition plays a crucial role in the numerical integration of the partial diierential equations. In our problems, the local behavior varies because of the nonlinear and singular nature of the equations. Attempts to introduce diierent length scales did not lead to improvement. We found that diierent forms of the equations have to be use...

متن کامل

Domain decomposition for model heterogeneous anisotropic problem

The main focus of this paper is to suggest a domain decomposition method for finite element approximations of elliptic problems with anisotropic coefficients in domains consisting of anisotropic shape rectangles. The theorems on traces of functions from Sobolev spaces play an important role in studying boundary value problems of partial differential equations. These theorems are commonly used f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Modern Physics D

سال: 2022

ISSN: ['1793-6594', '0218-2718']

DOI: https://doi.org/10.1142/s0218271822500286